Every Niching Method has its Niche : Fitness Sharing and Implicit Sharing

نویسندگان

  • Paul Darwen
  • Xin Yao
چکیده

Various extensions to the Genetic Algorithm (GA) attempt to nd all or most optima in a search space containing several optima. Many of these emulate natural speciation. For co-evolutionary learning to succeed in a range of management and control problems, such as learning game strategies, such methods must nd all or most optima. However, suitable comparison studies are rare. We compare two similar GA specia-tion methods, tness sharing and implicit sharing. Using a realistic letter classiication problem, we nd they have advantages under diierent circumstances. Implicit sharing covers optima more comprehensively, when the population is large enough for a species to form at each optimum. With a population not large enough to do this, tness sharing can nd the optima with larger basins of attraction, and ignore the peaks with narrow bases, while implicit sharing is more easily distracted. This indicates that for a speciated GA trying to nd as many near-global optima as possible, implicit sharing works well only if the population is large enough. This requires prior knowledge of how many peaks exist. In a co-evolutionary GA, individuals are evaluated by how they perform against individuals in the same GA population, or perhaps another GA running in parallel. This is a promising way to learn game strategies 1] 3] 17] 21]. Without speciation, a GA will converge to only one high-tness solution, due to genetic drift. So a co-evolutionary GA will converge and overspecialise to only one strategy for the game being learned. This generalises poorly, and is na vely vulnerable to novel strategies not in the converged population 3]. To overcome this problem, speciation can greatly delay genetic drift 12], and prevent the convergence and overspecialisation that can otherwise happen in co-evolutionary learning 3]. Speciation with co-evolution can also nd a repertoire of high-quality strategies for a game, giving improved generalisation 4]. However , this approach relies heavily on the speciated GA to nd all (or most) good strategies | as speciation nds more high-quality strategies, generalisation ability improves 4, page 92]. So knowing what GA speciation method covers more peaks is important for co-evolutionary learning, not only for games but for other management and control tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every Niching Method has its Niche: Fitness Sharing and Implicit Sharing Compared

Several extensions to the GA attempt to nd all or most optima in a search space containing multiple optima. Many of these methods emulate speciation in natural evolution. Such methods must nd all or most optima, in order for co-evolutionary learning to succeed a range of management and control problems, such as learning game strategies. However, studies on which method is suitable for what kind...

متن کامل

An Efficient Hierarchical Clustering Technique for Speciation

The sharing method or the basic clearing procedure are reliable niching methods. However, they suffer from a quite high complexity: from O(n2) to O(c n), where c is the number of subpopulations and n is the population size. In this paper, an efficient hierarchical clustering technique is presented, reducing the complexity of these niching methods to O(n log n). On the other hand, the minimal ni...

متن کامل

Asymmetric Sharing

Where natural evolution has lead to a wide variety of coexisting species, evolutionary algorithms tend to end up with nearly identical individuals. Techniques known as niching aim to avoid this. However, they often depend on a threshold parameter, known as the sharing radius or niche radius. It serves as a similarity threshold. This is a critical, problem-dependent parameter. How to set it is k...

متن کامل

Fitness sharing and niching methods revisited

Interest in multimodal optimization function is expanding rapidly since real-world optimization problems often require the location of multiple optima in the search space. In this context, fitness sharing has been used widely to maintain population diversity and permit the investigation of many peaks in the feasible domain. This paper reviews various strategies of sharing and proposes new recom...

متن کامل

A Variable Radius Niching Technique for Speciation in Genetic Algorithms

In this paper, a continuation of a variable radius niche technique called Dynamic Niche Clustering developed by (Gan & Warwick, 1999) is presented. The technique employs a separate dynamic population of overlapping niches that coexists alongside the normal population. An empirical analysis of the updated methodology on a large group of standard optimisation test-bed functions is also given. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996